Mega Code Archive

Categories
1) Android
2) ASP.Net
3) ASP.Net Tutorial
4) C
5) C Tutorial
6) C#
7) C# Book
8) C# by API
9) C# Tutorial
10) C++
11) C++ Tutorial
12) Delphi
13) Flash ActionScript
14) Flex
15) Java
16) Java Book
17) Java by API
18) Java Tutorial
19) JavaScript DHTML
20) JavaScript Reference
21) JavaScript Tutorial
22) MSOfficeExcel 2007 Tutorial
23) MSOfficePowerPoint 2007 Tutorial
24) MSOfficeWord 2007 Tutorial
25) MSSQL
26) MSSQL Tutorial
27) MySQL
28) MySQL Tutorial
29) Oracle PLSQL
30) Oracle PLSQL Tutorial
31) Perl
32) Php
33) PostgreSQL
34) Python
35) Python Tutorial
36) Ruby
37) Silverlight
38) VB.Net
39) VB.Net by API
40) VB.Net Tutorial
41) Visual C++ .NET
42) VisualBasic Script
43) XML
44) XML Tutorial

 

C++ Tutorial
1) Array
2) Bitset
3) Class
4) Data Types
5) Deque
6) Development
7) Exceptions
8) File Stream
9) Function
10) Language Basics
11) List
12) Map Multimap
13) Operator Overloading
14) Operators Statements
15) Pointer
16) Queue Stack
17) Set Multiset
18) STL Algorithms Binary Search
19) STL Algorithms Heap
20) STL Algorithms Helper
21) STL Algorithms Iterator
22) STL Algorithms Merge
23) STL Algorithms Min Max
24) STL Algorithms Modifying Sequence Operations
25) STL Algorithms Non Modifying Sequence Operations
26) STL Algorithms Sorting
27) STL Introduction
28) String
29) Structure
30) Template
31) Valarray
32) Vector

STL Algorithms Helper
1) Adjacent_difference
2) Algorithm
3) All permutations of ABC by use of next_permutation()
4) All permutations of ABC by use of prev_permutation()
5) Calculate sum of elements in a vector
6) Demonstrate bind2nd()
7) Demonstrate gslice()
8) Demonstrating the generic accumulate algorithm with a reverse iterator
9) Distance
10) Get the distance between two element in a list
11) Illustrating the generic accumulate algorithm with predicate
12) Illustrating the generic next_permutation algorithms
13) Illustrating the generic prev_permutation algorithms
14) Negate
15) Negators with find_if, not1, greater_equals
16) Next_permutation() and prev_permutation()
17) Replace_if bind2nd and greater
18) Replace_if, bind2nd and less
19) Slice a valarray
20) The total of the elements in a vector
21) Trasform, bind2nd and plus
22) Use a binary function object divides
23) Use adjacent_difference to convert elements in a container into relative values
24) Use back_insert_iterator to insert element into a vector
25) Use bind2nd() to create a unary function object that will return true when a value is greater than 10
26) Use inner_product to calculate inner reverse product
27) Use inner_product to process sum of all products(0 + 11 + 22 + 33 + 44 + 55 + 66)
28) Use inner_product with inner and outer operation
29) Use make_pair to insert pair value to a map
30) Use next_permutation to permute elements until they are sorted
31) Use not1() to reverse sort v
32) Use not2() to remove all characters that are not equal to H
33) Use numeric_limits to get max value for float, double and long double
34) Use numeric_limits to get max value for short, int and long
35) Use partial_sum to convert elements in a container into absolute values
36) Use partial_sum to print all partial products
37) Use partial_sum to print all partial sums
38) Use prev_permutation to permute elements until they are sorted in descending order
39) Use prev_permutation to permute until descending sorted
40) Use the generic count algorithm with predicate
41) Use unique_copy to copy elements in an array to list with back_inserter
42) Using the generic accumulate algorithm to compute a product by using a function object
43) Using the generic accumulate algorithm to compute a product by using multiplies
44) Whether char is signed
45) Whether numeric limits for type string exist